A transition logic for schemata conflicts
نویسندگان
چکیده
Conflict detection and analysis are of high importance, e.g., when integrating conceptual schemata, such as UML-Specifications, or analysing goal-fulfilment of sets of autonomous agents. In general, models for this introduce unnecessarily complicated frameworks with several disadvantages regarding semantics as well as complexity. This paper demonstrates that an important set of static and dynamic conflicts between specifications can be diagnosed using ordinary first-order modal logic. Furthermore, we show how the framework can be extended for handling situations when there are convex sets of probability measures over a state-space. Thus, representing specifications as conceptual schemata and using standard Kripke models of modal logic, augmented with an interval-valued probability measure, we propose instrumental definitions and procedures for conflict detection. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
A Unification Algorithm for GP 2 (Long Version)
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressions are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorith...
متن کاملA Unification Algorithm for GP 2
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressisons are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorit...
متن کاملA Unification Algorithm for GP 2 (Long Version)
The graph programming language GP 2 allows to apply sets of rule schemata (or “attributed” rules) non-deterministically. To analyse conflicts of programs statically, graphs labelled with expressions are overlayed to construct critical pairs of rule applications. Each overlay induces a system of equations whose solutions represent different conflicts. We present a rule-based unification algorith...
متن کاملExtension of Logic regression to Longitudinal data: Transition Logic Regression
Logic regression is a generalized regression and classification method that is able to make Boolean combinations as new predictive variables from the original binary variables. Logic regression was introduced for case control or cohort study with independent observations. Although in various studies, correlated observations occur due to different reasons, logic regression have not been studi...
متن کاملA Methodology for Integration of Heterogeneous Databases
The transformation of existing local databases to meet diverse application needs at the global level is performed through a four-layered procedure that stresses total schema integration and virtual integration of local databases. The proposed methodology covers both schema integration and database integration, and uses a four-layered schema architecture (local schemata, local object schemata, g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Data Knowl. Eng.
دوره 51 شماره
صفحات -
تاریخ انتشار 2004